#include<bits/stdc++.h>
using namespace std;
int h[100005],h1[100005],top=0,tmp=0,n,tmp2;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>tmp2;
        h[tmp2]++;
    }
    for(int i=1;i<=100005;i++) if(h[i]) h1[++top]=h[i];
    for(int i=2;i<=top;i++) tmp=(h1[i]>=h1[i-1])?(max(0,tmp-(h1[i]-h1[i-1]))):(tmp+h1[i-1]-h1[i]);
    cout<<tmp+h1[top];
    return 0;
}
